discrete-time gi/d-msp/1/k queue with n threshold policy

this paper presents a discrete-time single-server finite buffer n threshold policy queue with renewal input and discretemarkovian service process. the server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is n. we obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary variable and the imbedded markov chain techniques.various performance measures such as the loss probability, mean queue length and mean waiting time in the queue along with some numerical results have been presented. the proposed model has potential applications in the areas of computer andtelecommunication systems.